Structured Proofs in Isar/HOL
نویسنده
چکیده
Isar is an extension of the theorem prover Isabelle with a language for writing human-readable structured proofs. This paper is an introduction to the basic constructs of this language.
منابع مشابه
Three Years of Experience with Sledgehammer, a Practical Link between Automatic and Interactive Theorem Provers
Sledgehammer is a highly successful subsystem of Isabelle/HOL that calls automatic theorem provers to assist with interactive proof construction. It requires no user configuration: it can be invoked with a single mouse gesture at any point in a proof. It automatically finds relevant lemmas from all those currently available. An unusual aspect of its architecture is its use of unsound translatio...
متن کاملComputer-Assisted Mathematics at Work (The Hahn-Banach Theorem in Isabelle/Isar)
We present a complete formalization of the Hahn-Banach theorem in the simply-typed set-theory of Isabelle/HOL, such that both the modeling of the underlying mathematical notions and the full proofs are intelligible to human readers. This is achieved by means of the Isar environment, which provides a framework for high-level reasoning based on natural deduction. The final result is presented as ...
متن کاملThe 5 Colour Theorem in Isabelle/Isar
Based on an inductive definition of triangulations, a theory of undirected planar graphs is developed in Isabelle/HOL. The proof of the 5 colour theorem is discussed in some detail, emphasizing the readability of the computer assisted proofs.
متن کاملSome aspects of Unix file-system security
Unix is a simple but powerful system where everything is either a process or a file. Access to system resources works mainly via the filesystem, including special files and devices. Most Unix security issues are reflected directly within the file-system. We give a mathematical model of the main aspects of the Unix file-system including its security model, but ignoring processes. Within this for...
متن کاملGenerating Cases from Labeled Subgoals
Isabelle/Isar provides named cases to structure proofs. This article contains an implementation of a proof method casify, which can be used to easily extend proof tools with support for named cases. Such a proof tool must produce labeled subgoals, which are then interpreted by casify. As examples, this work contains verification condition generators producing named cases for three languages: Th...
متن کامل